搜索资源列表
dianlubanpailie
- VC6.0编程实现，可运行，分支限界法实现电路板排列问题-VC6.0 programming, run, branch and bound to achieve the board of the Arrangement
n_queen
- 这个包裹实现的是分支限界法解决n王后问题，input.txt和output.txt分别掌管输入n和输出一种方案-This package implements a branch and bound method to solve the n queens problem, input.txt and output.txt were in charge of input and output of a program of n
XHstudent
- 1.对多个链表进行操作 2.回溯法求解0/1背包 3.分枝限界法求解0/1背包 4.回溯法求解n—皇后问题 5.图的操作（邻接表表示）-1. Operate on multiple lists 2. Backtracking method for solving 0/1 knapsack 3. Branch and bound method for solving 0/1 knapsack 4. Backtracking to solve n-queens pr
Algorithmdesignandanalysisthe6chapterbranchconfine
- 分支限界的方法描述，有不同的9种分支限界方法-Branch and bound method described in 9 different branch and bound method
code
- 算法，装载问题，用分支限界做的,用vc++6.0写的，编译通过。 做实验的时候要求要做，于是就写了。-Algorithm, loading issues, to do with the branch and bound
0_1Knasack
- 比较了求解0-1背包问题常用的几种算法，并用回溯法和分支限界法进行了Java编程实现，给出了文档及源码。-0-1 knapsack problem compared several commonly used algorithms, and use backtracking and branch and bound method of the Java programming, given the documentation and source code.
Example
- example of branch and bound
knapbranch
- 0-1背包问题的分支定界算法实现。包含优先队列的实现细节。-0-1 knapsack problem branch and bound algorithm. Priority queue that contains the implementation details.
hamilton
- 分支定界法解旅行商问题的简单实现，用C++代码，效率经过优化后可以在1s内解规模为25左右的旅行商问题。附带了测试文件的自动生成工具。-Branch and bound method for solving the traveling salesman problem is simple to achieve, with the C++ code, the efficiency can be optimized through the solution 1s about the size of
xinhaojiance
- 几种 MIMO 最大似然检测算法性能与复杂度比较及改进，介绍了半定松弛、分枝定界和堆栈三种低复杂度最大似然检测算法，并对其性能和复杂度进行了仿真分析，提出了改进的分枝定界和堆栈算法，仿真结果证明分枝定界和堆栈算法性能要优于半定松弛算法，分枝定界算法的复杂度低于堆栈算法且半定松弛算法以多项式复杂度取得了逼近最大似然的性能，同时改进算法加快了算法收敛速度，降低了计算复杂度和对存储空间的要求。 -Several maximum likelihood MIMO detection algorithm
dd
- 分支限界法。这是一个“0 - 1 背包问题的分枝－限界算法”。文件压缩没有密码。-Branch and bound
fenzhijiexianfa
- 分支界限法是由“分支”和“界限”策略两个部分组成，其中“分支”策略是对问题空间按照广度优先的策略进行搜索；“限界”策略是为了加速搜索速度而采用启发信息剪枝的策略。 使用分支限界法来解决单源最短路径问题时主要利用结点控制关系剪枝，在一般情况下，如果解空间树中以结点Y为根的子树中所含的解优于以结点X为根的子树中所含的解，则结点Y控制了结点X，以被控制的结点X为根的子树可以剪去。算法实现时，使用邻接矩阵表示图，二维数组存储图的邻接矩阵，使用数组记录源到各顶点的距离和路径上的前驱顶点。 -Br
branchandbound
- The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the
01bag
- 实现经典0-1背包问题，采用动态规划、分枝限界、回溯法、贪心算法等四个算法分别实现0-1背包问题，并有一个四合一的算法统一用四种方法实现。并对其时间复杂度进行了分析。-To achieve the classic 0-1 knapsack problem, dynamic programming, branch and bound, backtracking, greedy algorithm to achieve the four algorithms are 0-1 knapsack pro
8ma
- 八数码难题，使用广度搜索，体现分支限界法的思想-Eight puzzle, use the search scope, reflecting the branch and bound ideas ×××××
fzxj
- 一般解空间的队列式分支限界法 试设计一个用队列式分支限界法搜索一般解空间的函数。该函数的参数包括结点可行性 判定函数和上界函数等必要的函数，并将此函数用于解布线问题。 -Queue-type general solution space try to design a branch and bound branch and bound with a queue-type search function of the general solution space. The funct
shortest-path
- 寻找单源最短路径问题的优先队列式分支限界法-Single-source shortest path problem priority queue type branch and bound
01-knapsack-problem--
- 01背包问题的优先队列式分支限界算法程序实现-01 knapsack problem with priority queues to achieve branch and bound algorithm program
traveler
- 旅行商问题的分支限界法 经典算法的JAVA实现-Traveling Salesman Problem classical branch and bound algorithm to achieve JAVA
ok
- branch and bound for flowshop problem